L’Université de Rennes 1
نویسندگان
چکیده
par Erwan Faou Quelques aspects géométriques en théorie des coques et en intégration numérique des systèmes hamiltoniens.
منابع مشابه
A simple proof of the necessity of the failure detector Σ to implement a register in asynchronous message-passing systems
This paper presents a simple proof that the quorum failure detector class (denoted Σ) is the weakest failure detector class required to implement an atomic read/write register in an asynchronous message-passing system prone to an arbitrary number of process crashes. Key-words: Asynchronous message-passing system, Atomic register, Necessity proof, Process crash, Weakest failure detector. Une pre...
متن کاملDynamic Choice for Individuals facing Irreversibility and Uncertainty: An experimental study
Laurent Denant-Boèmont CREREG (UMR CNRS) et Université de Rennes 1 7 place Hoche, 35065 Rennes cedex tél :02 23 23 35 83 / 02 23 23 80 84 [email protected] Sabrina Hammiche Laboratoire d’Economie des Transports (UMR CNRS) et Université de Bretagne Occidentale IUT de Quimper, 2 rue de l’Université, 29334 Quimper cedex Tél : 02 98 90 85 16 / fax :02 98 90 85 63 sabrina.Hammic...
متن کاملRelations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems
The k-set agreement problem is a coordination problem where each process is assumed to propose a value and each process that does not crash has to decide a value such that each decided value is a proposed value and at most k different values are decided. While it can always be solved in synchronous systems, k-set agreement has no solution in asynchronous send/receive message-passing systems whe...
متن کاملLooking for Efficient Implementations of Concurrent Objects
As introduced by Taubenfeld, a contention-sensitive implementation of a concurrent object is an implementation such that the overhead introduced by locking is eliminated in the common cases, i.e., when there is no contention or when the operations accessing concurrently the object are non-interfering. This paper, that can be considered as an introductory paper to this topic, presents a methodol...
متن کاملSignature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be “polluted” by the erroneous behavior of faulty processes. This paper considers the consensus agreement problem in a setting where some processes can behave arbitrarily (Byzantine behavior). In such a context it is poss...
متن کامل